Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
نویسندگان
چکیده
منابع مشابه
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
In the pickup and delivery problem with time windows (PDPTW), vehicle routes must be designed to satisfy a set of transportation requests, each involving a pickup and a delivery location, under capacity, time window, and precedence constraints. This paper introduces a new branch-and-cut-and-price algorithm in which lower bounds are computed by solving through column generation the linear progra...
متن کاملA branch-and-price algorithm for the pickup and delivery problem with time windows
In pickup and delivery problems vehicles have to transport loads from origins to destinations without transshipment at intermediate locations. In this paper, we describe an algorithm to solve such problems. The algorithm is based on a set partitioning formulation of the problem and uses new column generation and branching schemes.
متن کاملSolving the Pickup and Delivery Problem with Time Windows by Branch-and-Cut
In the Vehicle Routing Problem with Pickup and Delivery (VRPPD), a set of transportation requests must be satisfied by capacitated vehicles based at one or several depots. Each request is defined by an origin (or pickup point), a destination (or delivery point), and a demand to be transported from the origin to the destination. Typical applications are parcel services and dial-a-ride transporta...
متن کاملBranch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
This work proposes a Branch-cut-and-price (BCP) approach for the Vehicle Routing Problem with Simultaneous Pickup and Delivery (VRPSPD). We also deal with a particular case of the VRPSPD, known as the Vehicle Routing Problem with Mixed Pickup and Delivery. The BCP algorithm was tested in well-known benchmark instances involving up to 200 customers. Four instances were solved for the first time ...
متن کاملModels and branch-and-cut algorithms for pickup and delivery problems with time windows
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destinations. In addition to capacity and time window constraints, vehicle routes must also satisfy pairing and precedence constraints on pickups and deliveries. This paper introduces two new formulations for the PDPTW and the cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 2009
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.1090.0272